A Constraint-Based Declarative Programming Framework for Scheduling and Resource Allocation Problems
نویسندگان
چکیده
منابع مشابه
Solving Resource Allocation/Scheduling Problems with Constraint Integer Programming
Constraint Integer Programming (CIP) is a generalization of mixed-integer programming (MIP) in the direction of constraint programming (CP) allowing the inference techniques that have traditionally been the core of CP to be integrated with the problem solving techniques that form the core of complete MIP solvers. In this paper, we investigate the application of CIP to scheduling problems that r...
متن کاملConstraint Based Scheduling: Applying Constraint Programming to Scheduling Problems
Introducing a new hobby for other people may inspire them to join with you. Reading, as one of mutual hobby, is considered as the very easy hobby to do. But, many people are not interested in this hobby. Why? Boring is the reason of why. However, this feel actually can deal with the book and time of you reading. Yeah, one that we will refer to break the boredom in reading is choosing constraint...
متن کاملConstraint Programming for Hierarchical Resource Allocation
Resource allocation in a feasible or even cost-effective manner is a prominent task appearing in various domains such as energy management, grid computing, distributed heat management or the like. The mere size of future systems calls for mechanisms and algorithms that are able to address uncertainty and scalability – two issues that Organic Computing traditionally focuses on. In particular, se...
متن کاملA geometric framework for resource allocation problems
In a wide variety of industrial problems, a geographic region must be segmented into smaller regions to allocate resources. This is often done using combinatorial devices that discard the underlying geometry of the problem. In this paper we describe a geometric framework, map segmentation, for solving such problems and give several practical examples demonstrating the efficacy of such approaches.
متن کاملDeclarative Rule-Based Constraint Programming
The focus of this research is on the area of declarative rulebased constraint programming, in particular on answer set programming. Answer set programming (ASP) is an approach to rule-based constraint programming that has received increasing attention over the last few years. Rulebased programming seems like a natural way to represent specifications for several problems. The aim is to develop a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Vietnam Journal of Computer Science
سال: 2019
ISSN: 2196-8888,2196-8896
DOI: 10.1142/s2196888819500027